Cache aware multigrid for variable coefficient elliptic problems on adaptive mesh refinement hierarchies

نویسندگان

  • Craig C. Douglas
  • Jonathan J. Hu
  • Jaideep Ray
  • Danny Thorne
  • Ray S. Tuminaro
چکیده

1 University of Kentucky, Department of Computer Science, 325 McVey Hall, Lexington, KY 40506-0045, USA; also, Yale University, Department of Computer Science, P.O. Box 208285, New Haven, CT 06520-8285, USA, [email protected]. 2 Sandia National Laboratory, Mail Stop 9217, Livermore, CA 94550, USA, [email protected]. 3 Sandia National Laboratory, Combustion Research Facility, Mail Stop 9056, P.O. Box 969, Livermore, CA 94550, USA, [email protected]. 4 University of Kentucky, Department of Computer Science, 325 McVey Hall, Lexington, KY 40506-0045, USA, [email protected]. 5 Sandia National Laboratory, Mail Stop 9217, Livermore, CA 94550, USA, [email protected].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elliptic Solvers for Adaptive Mesh Refinement Grids

We are developing multigrid methods that will efficiently solve elliptic problems with anisotropic and discontinuous coefficients on adaptive grids. The final product will be a library that provides for the simplified solution of such problems. This library will directly benefit the efforts of other Laboratory groups. The focus of this work is research on serial and parallel elliptic algorithms...

متن کامل

Robust Aggregation-based Coarsening for Additive Schwarz in the Case of Highly Variable Coefficients

We study two–level overlapping domain decomposition preconditioners with coarse spaces obtained by smoothed aggregation in iterative solvers for finite element discretisations of second-order elliptic problems. We are particularly interested in the situation where the diffusion coefficient (or the permeability) α is highly variable throughout the domain. Our motivating example is Monte-Carlo si...

متن کامل

LOCAL MULTIGRID IN H(curl)

We consider H(curl, Ω)-elliptic variational problems on bounded Lipschitz polyhedra and their finite element Galerkin discretization by means of lowest order edge elements. We assume that the underlying tetrahedral mesh has been created by successive local mesh refinement, either by local uniform refinement with hanging nodes or bisection refinement. In this setting we develop a convergence the...

متن کامل

Adaptive Multilevel Correction Method for Finite Element Approximations of Elliptic Optimal Control Problems

In this paper we propose an adaptive multilevel correction scheme to solve optimal control problems discretized with finite element method. Different from the classical adaptive finite element method (AFEM for short) applied to optimal control which requires the solution of the optimization problem on new finite element space after each mesh refinement, with our approach we only need to solve t...

متن کامل

Multigrid Methods for Elliptic Obstacle Problems on 2D Bisection Grids

In this paper, we develop and analyze an efficient multigrid method to solve the finite element systems from elliptic obstacle problems on two dimensional adaptive meshes. Adaptive finite element methods (AFEMs) based on local mesh refinement are an important and efficient approach when the solution is non-smooth. An optimality theory on AFEM for linear elliptic equations can be found in Nochet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Numerical Lin. Alg. with Applic.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2004